A Local Genetic Algorithm for Binary-Coded Problems
نویسندگان
چکیده
Local Genetic Algorithms are search procedures designed in order to provide an effective local search. Several Genetic Algorithm models have recently been presented with this aim. In this paper we present a new Binary-coded Local Genetic Algorithm based on a Steady-State Genetic Algorithm with a crowding replacement method. We have compared a Multi-Start Local Search based on the Binary-Coded Local Genetic Algorithm with other instances of this metaheuristic based on Local Search Procedures presented in the literature. The results show that, for a wide range of problems, our proposal consistently outperforms the other local
منابع مشابه
Enhancing Rollover Threshold of an Elliptical Container Based on Binary-coded Genetic Algorithm
In this paper, a method based on binary-coded genetic algorithm is proposed to explore an optimization method, for obtaining an optimal elliptical tank. This optimization method enhances the rollover threshold of a tank vehicle, especially under partial filling conditions. Minimizing the overturning moment imposed on the vehicle due to c.g. height of the liquid load, lateral acceleration and ca...
متن کاملPerformance Analysis of Neural Networks Training using Real Coded Genetic Algorithm
Multilayer perceptrons (MLPs) are widely used for pattern classification and regression problems. Backpropagation (BP) algorithm is known technique in the training of multilayer perceptrons. However for its optimum training convergence, the learning and momentum parameters need to be tuned on trial and error method. Further, sometimes the backpropagation algorithm fails to achieve global conver...
متن کاملFacial expression recognition based on Local Binary Patterns
Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...
متن کاملLocal Search Based on Genetic Algorithms
Genetic Algorithms have been seen as search procedures that can quickly locate high performance regions of vast and complex search spaces, but they are not well suited for fine-tuning solutions, which are very close to optimal ones. However, genetic algorithms may be specifically designed to provide an effective local search as well. In fact, several genetic algorithm models have recently been ...
متن کاملOptimization of Meshless Local Petrov-Galerkin Parameters using Genetic Algorithm for 3D Elasto-static Problems (TECHNICAL NOTE)
A truly Meshless Local Petrov-Galerkin (MLPG) method is developed for solving 3D elasto-static problems. Using the general MLPG concept, this method is derived through the local weak forms of the equilibrium equations, by using a test function, namely, the Heaviside step function. The Moving Least Squares (MLS) are chosen to construct the shape functions. The penalty approach is used to impose ...
متن کامل